Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
نویسندگان
چکیده
منابع مشابه
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of formal understanding why this works so well. Focussing on the Planning context, we identify a form of problem structure concerned with the symmetrical or asymmetrical nature of the cost of achie...
متن کاملPlanning CNFs with Small DPLL Proofs
In order to better understand SAT-based planning and, more broadly, the good performance of current DPLL-based SAT solvers on real-world instances, we design three CNF formula families, two of which are derived from synthetic planning domains. The formulas are parameterized both in their size and in the amount of inherent structure. We investigate DPLL search tree size via the intermediate noti...
متن کاملA Concurrency Problem with Exponential DPLL(T) Proofs
Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is unsatisfiable once they have learned enough theory conflicts to derive a propositional contradiction. However some problems, such as the diamonds problem, requir...
متن کاملModeling the problem of selecting and assigning orders to suppliers based on the Goal planning, QFD and ANP combined approach
Vendor performance plays a key role in price, quality, timely delivery and service in achieving the goals of the supply chain. Given this, today's supplier performance has become a critical element in the success or failure of a company. In this study, an idealized planning model with multi-criteria decision-making approach with network analysis tool based on the expansion of fuzzy quality func...
متن کاملEnhanced Gaussian Elimination in DPLL-based SAT Solvers
When cryptographical problems are treated in SAT solvers, they often contain large set of XOR constraints. Treating these XOR constraints through on-the-fly Gaussian elimination during solving has been shown to be a viable approach by Soos et al. We describe various enhancements to this scheme which increase the performance and mostly eliminate the need for manual tuning of parameters. With the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2007
ISSN: 1860-5974
DOI: 10.2168/lmcs-3(1:6)2007